|
Shamir's Secret Sharing is an algorithm in cryptography created by Adi Shamir. It is a form of secret sharing, where a secret is divided into parts, giving each participant its own unique part, where some of the parts or all of them are needed in order to reconstruct the secret. Counting on all participants to combine the secret might be impractical, and therefore sometimes the ''threshold scheme'' is used where any of the parts are sufficient to reconstruct the original secret. ==Mathematical definition== The goal is to divide secret (e.g., a safe combination) into pieces of data in such a way that: # Knowledge of any or more pieces makes easily computable. # Knowledge of any or fewer pieces leaves completely undetermined (in the sense that all its possible values are equally likely). This scheme is called threshold scheme. If then all participants are required to reconstruct the secret. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Shamir's Secret Sharing」の詳細全文を読む スポンサード リンク
|